Long-time asymptotics for the Sasa–Satsuma equation via nonlinear steepest descent method
نویسندگان
چکیده
منابع مشابه
Long-Time Asymptotics for the Korteweg–de Vries Equation via Nonlinear Steepest Descent
We apply the method of nonlinear steepest descent to compute the long-time asymptotics of the Korteweg–de Vries equation for decaying initial data in the soliton and similarity region. This paper can be viewed as an expository introduction to this method.
متن کاملLong–time Asymptotics for the Nls Equation via ∂̄ Methods
−∞ log(z− s)d(log(1−|r(s)|2))+ π 4 + argΓ(iν(z))− argr(z). Here z0 = −x/(4t), Γ is the gamma function and the function r is the so-called reflection coefficient associated to the initial data q0, as described later in this section. Estimates on the size of the error term E (x,t) depend on the smoothness assumptions on q0. The above asymptotic form was first obtained in [10]. The nonlinear steep...
متن کاملSteepest descent method for solving zero-one nonlinear programming problems
In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original problem optimal solution. 2007 Elsevier Inc. All rights reserved.
متن کاملSoliton approach to the noisy Burgers equation Steepest descent method
The noisy Burgers equation in one spatial dimension is analyzed by means of the Martin-SiggiaRose technique in functional form. In a canonical formulation the morphology and scaling behavior are accessed by mean of a principle of least action in the asymptotic non-perturbative weak noise limit. The ensuing coupled saddle point field equations for the local slope and noise fields, replacing the ...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2019
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.5061793